False Alarms in Fault-tolerant Dominating Sets in Graphs
نویسنده
چکیده
We develop the problem of fault-tolerant dominating sets (liar’s dominating sets) in graphs. Namely, we consider a new kind of fault – a false alarm. Characterization of such fault-tolerant dominating sets in three different cases (dependent on the classification of the types of the faults) are presented.
منابع مشابه
Strength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملk-TUPLE DOMATIC IN GRAPHS
For every positive integer k, a set S of vertices in a graph G = (V;E) is a k- tuple dominating set of G if every vertex of V -S is adjacent to at least k vertices and every vertex of S is adjacent to at least k - 1 vertices in S. The minimum cardinality of a k-tuple dominating set of G is the k-tuple domination number of G. When k = 1, a k-tuple domination number is the well-studied domination...
متن کاملAlgorithms for Alarm Placement in Systems with Fault Propagation
In this paper, we consider systems that can be modeled as directed acyclic graphs such that nodes represent components and directed edges represent fault propagation between components. Some components can be equipped with alarms that ring when they detect faulty behavior. We study algorithms that attempt to minimize the number of alarms to be placed so that a fault at any single component can ...
متن کاملAlarm placement in systems with fault propagation
In this paper, we consider systems that can be modeled as directed acyclic graphs such that nodes represent components of the system and directed edges represent fault propagation between components. Some components can be equipped with alarms that ring when they detect faulty (abnormal) behavior. We study algorithms that attempt to minimize the number of alarms to be placed so that a fault at ...
متن کاملApproximating Fault-Tolerant Domination in General Graphs
In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k−1 nodes to fail and still dominate the graph. The classic minimum dominating set problem is a special case with k = 1. We show that the approach of having at least k dominating nodes in the neighborhood of every node is not optimal. For each α > 1 it can give solutions k α times la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012